The Saturation Property for Branching Rules - Examples
نویسندگان
چکیده
For a few pairs (G ⊂ Ĝ) of reductive groups, we study the decomposition of irreducible Ĝ-modules into G-modules. In particular, we observe the saturation property for all of these pairs.
منابع مشابه
تعارض بین مالیت بالفعل و شخصیت بالقوه جنین آزمایشگاهی
Artificial insemination or vitro embryo is one of the Medical Scientifics’ achievements be used for helping the modern human being. This matter would governed by particular ethical and law rules that would be distinguished from rules governing on the other product of the human bodies. Although vitro embryo can be changed to the human and obtained personality, but before it becomes to fetu...
متن کاملPredicting root biomass from branching patterns of Douglas-fir root systems
There are many examples of branching networks in nature, such as tree crowns, river systems, arteries and lungs. These networks have often been described as being self-similar, or following scale-invariant branching rules, and this property has been used to derive several scaling laws. In this paper we model root systems of Douglas-fir (Pseudotsuga menziesii var. glauca (Beissn.) Franco) as bra...
متن کاملar X iv : q - a lg / 9 50 50 06 v 1 4 M ay 1 99 5 SPBU - IP - 95 - 8 Recursion relations and branching rules for simple Lie algebras
The branching rules between simple Lie algebras and its regular (maximal) simple subal-gebras are studied. Two types of recursion relations for anomalous relative multiplicities are obtained. One of them is proved to be the factorized version of the other. The factorization property is based on the existence of the set of weights Γ specific for each injection. The structure of Γ is easily deduc...
متن کاملA Rule Format for Rooted Branching Bisimulation
SOS rule formats are sets of syntactical constraints over SOS transition rules ensuring semantical properties of the derived LTS. Given a rule format, our proposal is to try to relax the constraints imposed by the format on each single transition rule at the price of introducing some reasonable constraint on the form of the whole set of rules, obtaining a new format ensuring the same semantical...
متن کاملRich Counter-Examples for Temporal-Epistemic Logic Model Checking
Model checking verifies that a model of a system satisfies a given property, and otherwise produces a counter-example explaining the violation. The verified properties are formally expressed in temporal logics. Some temporal logics, such as CTL, are branching: they allow to express facts about the whole computation tree of the model, rather than on each single linear computation. This branching...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 22 شماره
صفحات -
تاریخ انتشار 2013